Results and conjectures on the number of standard strong marked tableaux

نویسندگان

Susanna Fishel

Matjaz Konvalinka

چکیده

Many results involving Schur functions have analogues involving k-Schur functions. Standard strong marked tableaux play a role for k-Schur functions similar to the role standard Young tableaux play for Schur functions. We discuss results and conjectures toward an analogue of the hook-length formula.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Conjectures and Open Problems on Partition Hook Lengths

Abstract. We present some conjectures and open problems on partition hook lengths, which are all motivated by known results on the subject. The conjectures are suggested by extensive experimental calculations using a computer algebra system. The first conjecture unifies two classical results on the number of standard Young tableaux and the number of pairs of standard Young tableaux of the same ...

متن کامل

Some Conjectures on the EnumerationofTableaux

We express general conjectures for explicit forms of P-recurrences for the number of Young standard tableaux of height bounded by h. These recurrences are compatible with known results and Regev's asymptotic evaluations. Le but de cette note est essentiellement de pr esenter des conjectures ainsi que des indications sur les raisons qui nous ont port ees a les enoncer. Nos conjectures concernent...

متن کامل

Corners in Tree-Like Tableaux

In this paper, we study tree–like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of corners in tree–like tableaux and the total number of corners in symmetric tree–like tableaux. In this paper, we prove both conjectures. Our proofs are based on ...

متن کامل

Generating Trees and Pattern Avoidance in Alternating Permutations

We extend earlier work of the same author to enumerate alternating permutations avoiding the permutation pattern 2143. We use a generating tree approach to construct a recursive bijection between the set A2n(2143) of alternating permutations of length 2n avoiding 2143 and the set of standard Young tableaux of shape 〈n, n, n〉, and between the set A2n+1(2143) of alternating permutations of length...

متن کامل